System and Method for Synchronizing Frequency Hopping Transmitters, Receivers, Transceivers, Repeaters and Other Radio Networks

ABSTRACT

A method of synchronizing frequency hopping transmitters, receivers, transceivers, repeaters and other radio networks is provided, utilizing non-coordinated shared frequencies bands that synchronizes communications between transmitter(s) and receiver(s) via a pool of frequencies having a first group of frequencies being assigned to transmit for a specific duration per frequency per transmission and a second group of frequencies in which the total number of frequencies is a paired first factor of the first group&#39;s total number of frequencies or a paired first factor of any factor of the first group&#39;s total number of frequencies and which is then divided into transmit slots, the duration being a fraction of the first groups transmit duration and also being the corresponding paired second factor of the first groups total number of frequencies.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present Utility patent application claims priority benefit of theU.S. provisional application for patent Ser. No. 62/459,609 entitled“Novel method for fast acquisition and reacquisition in a frequencyhopping radio system”, filed on 16 Feb. 2017 under 35 U.S.C. 119(e), andU.S. Utility patent application Ser. No. 15/898,415 entitled “A Systemand Method for Synchronizing Frequency Hopping Transmitters, Receivers,Transceivers, Repeaters and Other Radio Networks”, filed on 16 Feb. 2018under 35 USC 111(a). The contents of these related applications areincorporated herein by reference for all purposes to the extent thatsuch subject matter is not inconsistent herewith or limiting hereof.

RELATED CO-PENDING U.S. PATENT APPLICATIONS

Not applicable.

INCORPORATION BY REFERENCE OF SEQUENCE LISTING PROVIDED AS A TEXT FILE

Not applicable.

FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

REFERENCE TO SEQUENCE LISTING, A TABLE, OR A COMPUTER LISTING APPENDIX

Not applicable.

COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains materialthat is subject to copyright protection by the author thereof. Thecopyright owner has no objection to the facsimile reproduction by anyoneof the patent document or patent disclosure for the purposes ofreferencing as patent prior art, as it appears in the Patent andTrademark Office, patent file or records, but otherwise reserves allcopyright rights whatsoever.

BACKGROUND OF THE RELEVANT PRIOR ART

One or more embodiments of the invention generally relate to radiocommunication. More particularly, certain embodiments of the inventionrelate to synchronization.

The following background information may present examples of specificaspects of the prior art (e.g., without limitation, approaches, facts,or common wisdom) that, while expected to be helpful to further educatethe reader as to additional aspects of the prior art, is not to beconstrued as limiting the present invention, or any embodiments thereof,to anything stated or implied therein or inferred thereupon.

The following is an example of a specific aspect in the prior art that,while expected to be helpful to further educate the reader as toadditional aspects of the prior art, is not to be construed as limitingthe present invention, or any embodiments thereof, to anything stated orimplied therein or inferred thereupon. By way of educational background,an aspect of the prior art generally useful to be aware of is that inthe field of radio communications and specifically frequency hoppingsystems typically within shared frequency bands with a multiplicity ofuncoordinated devices competing for the same spectrum within the samegeographic area, it may commonly be useful to practice interferenceprediction, mitigation, and avoidance when certain transmissioncharacteristics are known such as the maximum duration a frequency maybe transmitted by a given device within a given period of time andwhether or not frequencies are used evenly on average over a givenperiod of time. In the frequency hopping radio communicationsmarketplace there is typically a growing demand for devices that canmitigate interference between competing devices on separate networkswithout the expense or complexity of an added frequency coordinationcomponent that must be administrated either in software or by the userthemselves. Furthermore, real time data transmission and reception suchas digital voice and other data transmission applications over frequencyhopping systems within the same network are usually more efficient whensynchronization may be fast and delays due to re-sending data are at aminimum.

With most frequency hopping systems using digital modulation techniques,typically as data rates increase the range may be reduced in the form ofwider transmit bandwidth causing degraded receiver sensitivity due towidening the receive filter bandwidth, therefore an efficient payload tooverhead ratio may be desired to maximize throughput while minimizingreceive degradation due to widening the receive filter bandwidth. Inmobile data and voice applications receiving devices commonly go in andout of range of the transmitted signal which may commonly cause hoppingsynchronization loss. Usually the less expensive the clock reference theshorter the duration of signal loss that will be tolerated beforere-synchronization is required. Typically in frequency hopping systemsthat utilize a multitude of frequencies within their hop cycle, onemethod of synchronizing a frequency hopping receiver with a frequencyhopping transmitter without the delays associated with the receiverscanning all frequencies in a particular hopset or waiting on onechannel until that channel may be used within the hop cycle, may be forthe receiver to tune to or scan one or more of a small number ofpredesignated channels from the hopset while the transmitter alwaysbegins transmission of the hopping cycle starting with that/those samefrequencies before proceeding on to the rest of the cycle.

In order to keep frequency usage equally distributed over time thetransmit duration of the frequencies used to start synchronization arecommonly kept the same as non-synchronization transmissions. Usuallythis forces receiver scan times thus the delay time to synchronizationto be directly proportional to the per frequency transmit duration ofthe particular frequency hopping system. Furthermore, if the receiverloses synchronization it must commonly wait until the hop cycle cyclesback around to those start frequencies described above in order toregain synchronization. Another known solution may be for the receiverto hop at a much slower rate than the transmitter. The receiver hopdwell times will typically be the transmitter dwell time multiplied bythe number of channels, however this can lead to significantsynchronization delay as the number of designated hopping channelsincreases in a system. One way to solve the receive scan time issue maybe to use multiple scanning receivers each coordinated to tune todifferent frequencies in order to speed up the scanning and thus thesynchronization. This however may be costly and does not help toincrease the payload data throughput efficiency on the transmit side.

In view of the foregoing, it is clear that these traditional techniquesare not perfect and leave room for more optimal approaches.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and not by wayof limitation, in the figures of the accompanying drawings and in whichlike reference numerals refer to similar elements and in which:

FIGS. 1A and 1B are flow charts illustrating an exemplary process todetermine a hopping interleave ratio and timing to be implemented withina logic section of a radio transmitter, receiver, transceiver orrepeater device, where 1B is a continuation of 1A, in accordance with anembodiment of the invention;

With reference to FIGS. 1A, 1B and 2, FIG. 2 illustrates an exemplarypossible hopping pattern resulting from the steps in FIGS. 1A and 1B, inaccordance with an embodiment of the invention;

FIG. 3A illustrates an exemplary block diagram of data transmittedwithin a typical acquisition slot, in accordance with an embodiment ofthe invention;

FIG. 3B illustrates an exemplary flowchart for receiver scanning of thetransmitted acquisition channels and subsequent synchronization, inaccordance with an embodiment of the invention;

FIG. 4A illustrates an exemplary block diagram embodiment of a hoppingpattern used in half duplex communications with correspondingtransmission signal flow, in accordance with an embodiment of theinvention;

FIG. 4B illustrates exemplary user level radio transceivers utilizingthe invention, in accordance with an embodiment of the invention;

With reference to FIGS. 1A to 3B and FIG. 5A, FIG. 5A illustrates anexemplary block diagram of a single frame according to the method asdescribed in the detailed descriptions for FIGS. 1A to 3B whenimplemented in a half duplex 2 position time division multiple accessconfiguration, in accordance with an embodiment of the invention;

With reference to FIGS. 5A and 5B, FIG. 5B illustrates exemplary radiotransceivers implementing the method described in FIG. 5A, in accordancewith an embodiment of the invention;

With reference to FIGS. 1 to 3B, and 6A, FIG. 6A illustrates anexemplary block diagram embodiment of one single hop frame showing time,frequencies, and signal direction for a transmitter, repeater andreceiver utilizing the method as described in FIGS. 1A to 3B within atime division duplex system, in accordance with an embodiment of theinvention;

With reference to FIGS. 6A and 6B, FIG. 6B illustrates exemplary radiotransceivers implementing the method described in FIG. 6A, in accordancewith an embodiment of the invention;

With reference to FIGS. 1A to 3B and 7A, FIG. 7A illustrates anexemplary block diagram of a single hop frame showing time, frequencies,and signal direction for two distinct transmitters, one repeater and twodistinct receivers utilizing the method as described in the detaileddescriptions for FIGS. 1A to 3B above within a two channel time divisionduplex and multiple access system, in accordance with an embodiment ofthe invention;

FIGS. 7A and 7B, FIG. 7B show exemplary radio transceivers implementingthe method described in 7A, in accordance with an embodiment of theinvention;

FIG. 8 illustrates an exemplary software system modules architecturediagram, in accordance with an embodiment of the invention;

FIG. 9 illustrates a block diagram depicting a conventionalclient/server communication system, which may be used by an exemplaryweb-enabled/networked embodiment of the present invention;

FIG. 10 is a block diagram depicting an exemplary client/server systemwhich may be used by an exemplary web-enabled/networked embodiment ofthe present invention.

Unless otherwise indicated illustrations in the figures are notnecessarily drawn to scale.

DETAILED DESCRIPTION OF SOME EMBODIMENTS

The present invention is best understood by reference to the detailedfigures and description set forth herein.

Embodiments of the invention are discussed below with reference to theFigures. However, those skilled in the art will readily appreciate thatthe detailed description given herein with respect to these figures isfor explanatory purposes as the invention extends beyond these limitedembodiments. For example, it should be appreciated that those skilled inthe art will, in light of the teachings of the present invention,recognize a multiplicity of alternate and suitable approaches, dependingupon the needs of the particular application, to implement thefunctionality of any given detail described herein, beyond theparticular implementation choices in the following embodiments describedand shown. That is, there are modifications and variations of theinvention that are too numerous to be listed but that all fit within thescope of the invention. Also, singular words should be read as pluraland vice versa and masculine as feminine and vice versa, whereappropriate, and alternative embodiments do not necessarily imply thatthe two are mutually exclusive.

It is to be further understood that the present invention is not limitedto the particular methodology, compounds, materials, manufacturingtechniques, uses, and applications, described herein, as these may vary.It is also to be understood that the terminology used herein is used forthe purpose of describing particular embodiments only, and is notintended to limit the scope of the present invention. It must be notedthat as used herein and in the appended claims, the singular forms “a,”“an,” and “the” include the plural reference unless the context clearlydictates otherwise. Thus, for example, a reference to “an element” is areference to one or more elements and includes equivalents thereof knownto those skilled in the art. Similarly, for another example, a referenceto “a step” or “a means” is a reference to one or more steps or meansand may include sub-steps and subservient means. All conjunctions usedare to be understood in the most inclusive sense possible. Thus, theword “or” should be understood as having the definition of a logical“or” rather than that of a logical “exclusive or” unless the contextclearly necessitates otherwise. Structures described herein are to beunderstood also to refer to functional equivalents of such structures.Language that may be construed to express approximation should be sounderstood unless the context clearly dictates otherwise.

All words of approximation as used in the present disclosure and claimsshould be construed to mean “approximate,” rather than “perfect,” andmay accordingly be employed as a meaningful modifier to any other word,specified parameter, quantity, quality, or concept. Words ofapproximation, include, yet are not limited to terms such as“substantial”, “nearly”, “almost”, “about”, “generally”, “largely”,“essentially”, “closely approximate”, etc.

As will be established in some detail below, it is well settled law, asearly as 1939, that words of approximation are not indefinite in theclaims even when such limits are not defined or specified in thespecification.

For example, see Ex parte Mallory, 52 USPQ 297, 297 (Pat. Off. Bd. App.1941) where the court said “The examiner has held that most of theclaims are inaccurate because apparently the laminar film will not beentirely eliminated. The claims specify that the film is “substantially”eliminated and for the intended purpose, it is believed that the slightportion of the film which may remain is negligible. We are of the view,therefore, that the claims may be regarded as sufficiently accurate.”

Note that claims need only “reasonably apprise those skilled in the art”as to their scope to satisfy the definiteness requirement. See EnergyAbsorption Sys., Inc. v. Roadway Safety Servs., Inc., Civ. App. 96-1264,slip op. at 10 (Fed. Cir. Jul. 3, 1997) (unpublished) Hybridtech v.Monoclonal Antibodies, Inc., 802 F.2d 1367, 1385, 231 USPQ 81, 94 (Fed.Cir. 1986), cert. denied, 480 U.S. 947 (1987). In addition, the use ofmodifiers in the claim, like “generally” and “substantial,” does not byitself render the claims indefinite. See Seattle Box Co. v. IndustrialCrating & Packing, Inc., 731 F.2d 818, 828-29, 221 USPQ 568, 575-76(Fed. Cir. 1984).

Moreover, the ordinary and customary meaning of terms like“substantially” includes “reasonably close to: nearly, almost, about”,connoting a term of approximation. See In re Frye, Appeal No.2009-006013, 94 USPQ2d 1072, 1077, 2010 WL 889747 (B.P.A.I. 2010)Depending on its usage, the word “substantially” can denote eitherlanguage of approximation or language of magnitude. Deering PrecisionInstruments, L.L.C. v. Vector Distribution Sys., Inc., 347 F.3d 1314,1323 (Fed. Cir. 2003) (recognizing the “dual ordinary meaning of th[e]term [“substantially”] as connoting a term of approximation or a term ofmagnitude”). Here, when referring to the “substantially halfway”limitation, the Specification uses the word “approximately” as asubstitute for the word “substantially” (Fact 4). (Fact 4). The ordinarymeaning of “substantially halfway” is thus reasonably close to or nearlyat the midpoint between the forwardmost point of the upper or outsoleand the rearwardmost point of the upper or outsole.

Similarly, the term ‘substantially’ is well recognized in case law tohave the dual ordinary meaning of connoting a term of approximation or aterm of magnitude. See Dana Corp. v. American Axle & Manufacturing,Inc., Civ. App. 04-1116, 2004 U.S. App. LEXIS 18265, *13-14 (Fed. Cir.Aug. 27, 2004) (unpublished). The term “substantially” is commonly usedby claim drafters to indicate approximation. See Cordis Corp. v.Medtronic AVE Inc., 339 F.3d 1352, 1360 (Fed. Cir. 2003) (“The patentsdo not set out any numerical standard by which to determine whether thethickness of the wall surface is ‘substantially uniform.’ The term‘substantially,’ as used in this context, denotes approximation. Thus,the walls must be of largely or approximately uniform thickness.”); seealso Deering Precision Instruments, LLC v. Vector Distribution Sys.,Inc., 347 F.3d 1314, 1322 (Fed. Cir. 2003); Epcon Gas Sys., Inc. v.Bauer Compressors, Inc., 279 F.3d 1022, 1031 (Fed. Cir. 2002). We findthat the term “substantially” was used in just such a manner in theclaims of the patents-in-suit: “substantially uniform wall thickness”denotes a wall thickness with approximate uniformity.

It should also be noted that such words of approximation as contemplatedin the foregoing clearly limits the scope of claims such as saying‘generally parallel’ such that the adverb ‘generally’ does not broadenthe meaning of parallel. Accordingly, it is well settled that such wordsof approximation as contemplated in the foregoing (e.g., like the phrase‘generally parallel’) envisions some amount of deviation from perfection(e.g., not exactly parallel), and that such words of approximation ascontemplated in the foregoing are descriptive terms commonly used inpatent claims to avoid a strict numerical boundary to the specifiedparameter. To the extent that the plain language of the claims relyingon such words of approximation as contemplated in the foregoing areclear and uncontradicted by anything in the written description hereinor the figures thereof, it is improper to rely upon the present writtendescription, the figures, or the prosecution history to add limitationsto any of the claim of the present invention with respect to such wordsof approximation as contemplated in the foregoing. That is, under suchcircumstances, relying on the written description and prosecutionhistory to reject the ordinary and customary meanings of the wordsthemselves is impermissible. See, for example, Liquid Dynamics Corp. v.Vaughan Co., 355 F.3d 1361, 69 USPQ2d 1595, 1600-01 (Fed. Cir. 2004).The plain language of phrase 2 requires a “substantial helical flow.”The term “substantial” is a meaningful modifier implying “approximate,”rather than “perfect.” In Cordis Corp. v. Medtronic AVE, Inc., 339 F.3d1352, 1361 (Fed. Cir. 2003), the district court imposed a precisenumeric constraint on the term “substantially uniform thickness.” Wenoted that the proper interpretation of this term was “of largely orapproximately uniform thickness” unless something in the prosecutionhistory imposed the “clear and unmistakable disclaimer” needed fornarrowing beyond this simple-language interpretation. Id. In Anchor WallSystems v. Rockwood Retaining Walls, Inc., 340 F.3d 1298, 1311 (Fed.Cir. 2003)” Id. at 1311. Similarly, the plain language of claim 1requires neither a perfectly helical flow nor a flow that returnsprecisely to the center after one rotation (a limitation that arisesonly as a logical consequence of requiring a perfectly helical flow).

The reader should appreciate that case law generally recognizes a dualordinary meaning of such words of approximation, as contemplated in theforegoing, as connoting a term of approximation or a term of magnitude;e.g., see Deering Precision Instruments, L.L.C. v. Vector Distrib. Sys.,Inc., 347 F.3d 1314, 68 USPQ2d 1716, 1721 (Fed. Cir. 2003), cert.denied, 124 S. Ct. 1426 (2004) where the court was asked to construe themeaning of the term “substantially” in a patent claim. Also see Epcon,279 F.3d at 1031 (“The phrase ‘substantially constant’ denotes languageof approximation, while the phrase ‘substantially below’ signifieslanguage of magnitude, i.e., not insubstantial.”). Also, see, e.g.,Epcon Gas Sys., Inc. v. Bauer Compressors, Inc., 279 F.3d 1022 (Fed.Cir. 2002) (construing the terms “substantially constant” and“substantially below”); Zodiac Pool Care, Inc. v. Hoffinger Indus.,Inc., 206 F.3d 1408 (Fed. Cir. 2000) (construing the term “substantiallyinward”); York Prods., Inc. v. Cent. Tractor Farm & Family Ctr., 99 F.3d1568 (Fed. Cir. 1996) (construing the term “substantially the entireheight thereof”); Tex. Instruments Inc. v. Cypress Semiconductor Corp.,90 F.3d 1558 (Fed. Cir. 1996) (construing the term “substantially in thecommon plane”). In conducting their analysis, the court instructed tobegin with the ordinary meaning of the claim terms to one of ordinaryskill in the art. Prima Tek, 318 F.3d at 1148. Reference to dictionariesand our cases indicates that the term “substantially” has numerousordinary meanings. As the district court stated, “substantially” canmean “significantly” or “considerably.” The term “substantially” canalso mean “largely” or “essentially.” Webster's New 20th CenturyDictionary 1817 (1983).

Words of approximation, as contemplated in the foregoing, may also beused in phrases establishing approximate ranges or limits, where the endpoints are inclusive and approximate, not perfect; e.g., see AK SteelCorp. v. Sollac, 344 F.3d 1234, 68 USPQ2d 1280, 1285 (Fed. Cir. 2003)where it where the court said [W]e conclude that the ordinary meaning ofthe phrase “up to about 10%” includes the “about 10%” endpoint. Aspointed out by AK Steel, when an object of the preposition “up to” isnonnumeric, the most natural meaning is to exclude the object (e.g.,painting the wall up to the door). On the other hand, as pointed out bySollac, when the object is a numerical limit, the normal meaning is toinclude that upper numerical limit (e.g., counting up to ten, seatingcapacity for up to seven passengers). Because we have here a numericallimit—“about 10%”—the ordinary meaning is that that endpoint isincluded.

In the present specification and claims, a goal of employment of suchwords of approximation, as contemplated in the foregoing, is to avoid astrict numerical boundary to the modified specified parameter, assanctioned by Pall Corp. v. Micron Separations, Inc., 66 F.3d 1211,1217, 36 USPQ2d 1225, 1229 (Fed. Cir. 1995) where it states “It is wellestablished that when the term “substantially” serves reasonably todescribe the subject matter so that its scope would be understood bypersons in the field of the invention, and to distinguish the claimedsubject matter from the prior art, it is not indefinite.” Likewise seeVerve LLC v. Crane Cams Inc., 311 F.3d 1116, 65 USPQ2d 1051, 1054 (Fed.Cir. 2002). Expressions such as “substantially” are used in patentdocuments when warranted by the nature of the invention, in order toaccommodate the minor variations that may be appropriate to secure theinvention. Such usage may well satisfy the charge to “particularly pointout and distinctly claim” the invention, 35 U.S.C. § 112, and indeed maybe necessary in order to provide the inventor with the benefit of hisinvention. In Andrew Corp. v. Gabriel Elecs. Inc., 847 F.2d 819, 821-22,6 USPQ2d 2010, 2013 (Fed. Cir. 1988) the court explained that usagessuch as “substantially equal” and “closely approximate” may serve todescribe the invention with precision appropriate to the technology andwithout intruding on the prior art. The court again explained in EcolabInc. v. Envirochem, Inc., 264 F.3d 1358, 1367, 60 USPQ2d 1173, 1179(Fed. Cir. 2001) that “like the term ‘about,’ the term ‘substantially’is a descriptive term commonly used in patent claims to ‘avoid a strictnumerical boundary to the specified parameter, see Ecolab Inc. v.Envirochem Inc., 264 F.3d 1358, 60 USPQ2d 1173, 1179 (Fed. Cir. 2001)where the court found that the use of the term “substantially” to modifythe term “uniform” does not render this phrase so unclear such thatthere is no means by which to ascertain the claim scope.

Similarly, other courts have noted that like the term “about,” the term“substantially” is a descriptive term commonly used in patent claims to“avoid a strict numerical boundary to the specified parameter.”; e.g.,see Pall Corp. v. Micron Seps., 66 F.3d 1211, 1217, 36 USPQ2d 1225, 1229(Fed. Cir. 1995); see, e.g., Andrew Corp. v. Gabriel Elecs. Inc., 847F.2d 819, 821-22, 6 USPQ2d 2010, 2013 (Fed. Cir. 1988) (noting thatterms such as “approach each other,” “close to,” “substantially equal,”and “closely approximate” are ubiquitously used in patent claims andthat such usages, when serving reasonably to describe the claimedsubject matter to those of skill in the field of the invention, and todistinguish the claimed subject matter from the prior art, have beenaccepted in patent examination and upheld by the courts). In this case,“substantially” avoids the strict 100% nonuniformity boundary.

Indeed, the foregoing sanctioning of such words of approximation, ascontemplated in the foregoing, has been established as early as 1939,see Ex parte Mallory, 52 USPQ 297, 297 (Pat. Off. Bd. App. 1941) where,for example, the court said “the claims specify that the film is“substantially” eliminated and for the intended purpose, it is believedthat the slight portion of the film which may remain is negligible. Weare of the view, therefore, that the claims may be regarded assufficiently accurate.” Similarly, In re Hutchison, 104 F.2d 829, 42USPQ 90, 93 (C.C.P.A. 1939) the court said “It is realized that“substantial distance” is a relative and somewhat indefinite term, orphrase, but terms and phrases of this character are not uncommon inpatents in cases where, according to the art involved, the meaning canbe determined with reasonable clearness.”

Hence, for at least the forgoing reason, Applicants submit that it isimproper for any examiner to hold as indefinite any claims of thepresent patent that employ any words of approximation.

Unless defined otherwise, all technical and scientific terms used hereinhave the same meanings as commonly understood by one of ordinary skillin the art to which this invention belongs. Preferred methods,techniques, devices, and materials are described, although any methods,techniques, devices, or materials similar or equivalent to thosedescribed herein may be used in the practice or testing of the presentinvention. Structures described herein are to be understood also torefer to functional equivalents of such structures. The presentinvention will be described in detail below with reference toembodiments thereof as illustrated in the accompanying drawings.

References to a “device,” an “apparatus,” a “system,” etc., in thepreamble of a claim should be construed broadly to mean “any structuremeeting the claim terms” exempt for any specific structure(s)/type(s)that has/(have) been explicitly disavowed or excluded oradmitted/implied as prior art in the present specification or incapableof enabling an object/aspect/goal of the invention. Furthermore, wherethe present specification discloses an object, aspect, function, goal,result, or advantage of the invention that a specific prior artstructure and/or method step is similarly capable of performing yet in avery different way, the present invention disclosure is intended to andshall also implicitly include and cover additional correspondingalternative embodiments that are otherwise identical to that explicitlydisclosed except that they exclude such prior art structure(s)/step(s),and shall accordingly be deemed as providing sufficient disclosure tosupport a corresponding negative limitation in a claim claiming suchalternative embodiment(s), which exclude such very different prior artstructure(s)/step(s) way(s).

From reading the present disclosure, other variations and modificationswill be apparent to persons skilled in the art. Such variations andmodifications may involve equivalent and other features which arealready known in the art, and which may be used instead of or inaddition to features already described herein.

Although Claims have been formulated in this Application to particularcombinations of features, it should be understood that the scope of thedisclosure of the present invention also includes any novel feature orany novel combination of features disclosed herein either explicitly orimplicitly or any generalization thereof, whether or not it relates tothe same invention as presently claimed in any Claim and whether or notit mitigates any or all of the same technical problems as does thepresent invention.

Features which are described in the context of separate embodiments mayalso be provided in combination in a single embodiment. Conversely,various features which are, for brevity, described in the context of asingle embodiment, may also be provided separately or in any suitablesubcombination. The Applicants hereby give notice that new Claims may beformulated to such features and/or combinations of such features duringthe prosecution of the present Application or of any further Applicationderived therefrom.

References to “one embodiment,” “an embodiment,” “example embodiment,”“various embodiments,” “some embodiments,” “embodiments of theinvention,” etc., may indicate that the embodiment(s) of the inventionso described may include a particular feature, structure, orcharacteristic, but not every possible embodiment of the inventionnecessarily includes the particular feature, structure, orcharacteristic. Further, repeated use of the phrase “in one embodiment,”or “in an exemplary embodiment,” “an embodiment,” do not necessarilyrefer to the same embodiment, although they may. Moreover, any use ofphrases like “embodiments” in connection with “the invention” are nevermeant to characterize that all embodiments of the invention must includethe particular feature, structure, or characteristic, and should insteadbe understood to mean “at least some embodiments of the invention”include the stated particular feature, structure, or characteristic.

References to “user”, or any similar term, as used herein, may mean ahuman or non-human user thereof. Moreover, “user”, or any similar term,as used herein, unless expressly stipulated otherwise, is contemplatedto mean users at any stage of the usage process, to include, withoutlimitation, direct user(s), intermediate user(s), indirect user(s), andend user(s). The meaning of “user”, or any similar term, as used herein,should not be otherwise inferred or induced by any pattern(s) ofdescription, embodiments, examples, or referenced prior-art that may (ormay not) be provided in the present patent.

References to “end user”, or any similar term, as used herein, isgenerally intended to mean late stage user(s) as opposed to early stageuser(s). Hence, it is contemplated that there may be a multiplicity ofdifferent types of “end user” near the end stage of the usage process.Where applicable, especially with respect to distribution channels ofembodiments of the invention comprising consumed retailproducts/services thereof (as opposed to sellers/vendors or OriginalEquipment Manufacturers), examples of an “end user” may include, withoutlimitation, a “consumer”, “buyer”, “customer”, “purchaser”, “shopper”,“enjoyer”, “viewer”, or individual person or non-human thing benefitingin any way, directly or indirectly, from use of or interaction, withsome aspect of the present invention.

In some situations, some embodiments of the present invention mayprovide beneficial usage to more than one stage or type of usage in theforegoing usage process. In such cases where multiple embodimentstargeting various stages of the usage process are described, referencesto “end user”, or any similar term, as used therein, are generallyintended to not include the user that is the furthest removed, in theforegoing usage process, from the final user therein of an embodiment ofthe present invention.

Where applicable, especially with respect to retail distributionchannels of embodiments of the invention, intermediate user(s) mayinclude, without limitation, any individual person or non-human thingbenefiting in any way, directly or indirectly, from use of, orinteraction with, some aspect of the present invention with respect toselling, vending, Original Equipment Manufacturing, marketing,merchandising, distributing, service providing, and the like thereof.

References to “person”, “individual”, “human”, “a party”, “animal”,“creature”, or any similar term, as used herein, even if the context orparticular embodiment implies living user, maker, or participant, itshould be understood that such characterizations are sole by way ofexample, and not limitation, in that it is contemplated that any suchusage, making, or participation by a living entity in connection withmaking, using, and/or participating, in any way, with embodiments of thepresent invention may be substituted by such similar performed by asuitably configured non-living entity, to include, without limitation,automated machines, robots, humanoids, computational systems,information processing systems, artificially intelligent systems, andthe like. It is further contemplated that those skilled in the art willreadily recognize the practical situations where such living makers,users, and/or participants with embodiments of the present invention maybe in whole, or in part, replaced with such non-living makers, users,and/or participants with embodiments of the present invention. Likewise,when those skilled in the art identify such practical situations wheresuch living makers, users, and/or participants with embodiments of thepresent invention may be in whole, or in part, replaced with suchnon-living makers, it will be readily apparent in light of the teachingsof the present invention how to adapt the described embodiments to besuitable for such non-living makers, users, and/or participants withembodiments of the present invention. Thus, the invention is thus toalso cover all such modifications, equivalents, and alternatives fallingwithin the spirit and scope of such adaptations and modifications, atleast in part, for such non-living entities.

Headings provided herein are for convenience and are not to be taken aslimiting the disclosure in any way.

The enumerated listing of items does not imply that any or all of theitems are mutually exclusive, unless expressly specified otherwise.

It is understood that the use of specific component, device and/orparameter names are for example only and not meant to imply anylimitations on the invention. The invention may thus be implemented withdifferent nomenclature/terminology utilized to describe themechanisms/units/structures/components/devices/parameters herein,without limitation. Each term utilized herein is to be given itsbroadest interpretation given the context in which that term isutilized.

Terminology. The following paragraphs provide definitions and/or contextfor terms found in this disclosure (including the appended claims):

“Comprising.” This term is open-ended. As used in the appended claims,this term does not foreclose additional structure or steps. Consider aclaim that recites: “A memory controller comprising a system cache . . .” Such a claim does not foreclose the memory controller from includingadditional components (e.g., a memory channel unit, a switch).

“Configured To.” Various units, circuits, or other components may bedescribed or claimed as “configured to” perform a task or tasks. In suchcontexts, “configured to” or “operable for” is used to connote structureby indicating that the mechanisms/units/circuits/components includestructure (e.g., circuitry and/or mechanisms) that performs the task ortasks during operation. As such, the mechanisms/unit/circuit/componentcan be said to be configured to (or be operable) for perform(ing) thetask even when the specified mechanisms/unit/circuit/component is notcurrently operational (e.g., is not on). Themechanisms/units/circuits/components used with the “configured to” or“operable for” language include hardware—for example, mechanisms,structures, electronics, circuits, memory storing program instructionsexecutable to implement the operation, etc. Reciting that amechanism/unit/circuit/component is “configured to” or “operable for”perform(ing) one or more tasks is expressly intended not to invoke 35U.S.C. sctn. 112, sixth paragraph, for thatmechanism/unit/circuit/component. “Configured to” may also includeadapting a manufacturing process to fabricate devices or components thatare adapted to implement or perform one or more tasks.

“Based On.” As used herein, this term is used to describe one or morefactors that affect a determination. This term does not forecloseadditional factors that may affect a determination. That is, adetermination may be solely based on those factors or based, at least inpart, on those factors. Consider the phrase “determine A based on B.”While B may be a factor that affects the determination of A, such aphrase does not foreclose the determination of A from also being basedon C. In other instances, A may be determined based solely on B.

The terms “a”, “an” and “the” mean “one or more”, unless expresslyspecified otherwise.

Unless otherwise indicated, all numbers expressing conditions,concentrations, dimensions, and so forth used in the specification andclaims are to be understood as being modified in all instances by theterm “about.” Accordingly, unless indicated to the contrary, thenumerical parameters set forth in the following specification andattached claims are approximations that may vary depending at least upona specific analytical technique.

The term “comprising,” which is synonymous with “including,”“containing,” or “characterized by” is inclusive or open-ended and doesnot exclude additional, unrecited elements or method steps. “Comprising”is a term of art used in claim language which means that the named claimelements are essential, but other claim elements may be added and stillform a construct within the scope of the claim.

As used herein, the phase “consisting of” excludes any element, step, oringredient not specified in the claim. When the phrase “consists of” (orvariations thereof) appears in a clause of the body of a claim, ratherthan immediately following the preamble, it limits only the element setforth in that clause; other elements are not excluded from the claim asa whole. As used herein, the phase “consisting essentially of” and“consisting of” limits the scope of a claim to the specified elements ormethod steps, plus those that do not materially affect the basis andnovel characteristic(s) of the claimed subject matter (see Norian Corp.v Stryker Corp., 363 F.3d 1321, 1331-32, 70 USPQ2d 1508, Fed. Cir.2004). Moreover, for any claim of the present invention which claims anembodiment “consisting essentially of” or “consisting of” a certain setof elements of any herein described embodiment it shall be understood asobvious by those skilled in the art that the present invention alsocovers all possible varying scope variants of any describedembodiment(s) that are each exclusively (i.e., “consisting essentiallyof”) functional subsets or functional combination thereof such that eachof these plurality of exclusive varying scope variants each consistsessentially of any functional subset(s) and/or functional combination(s)of any set of elements of any described embodiment(s) to the exclusionof any others not set forth therein. That is, it is contemplated that itwill be obvious to those skilled how to create a multiplicity ofalternate embodiments of the present invention that simply consistingessentially of a certain functional combination of elements of anydescribed embodiment(s) to the exclusion of any others not set forththerein, and the invention thus covers all such exclusive embodiments asif they were each described herein.

With respect to the terms “comprising,” “consisting of,” and “consistingessentially of,” where one of these three terms is used herein, thedisclosed and claimed subject matter may include the use of either ofthe other two terms. Thus in some embodiments not otherwise explicitlyrecited, any instance of “comprising” may be replaced by “consisting of”or, alternatively, by “consisting essentially of”, and thus, for thepurposes of claim support and construction for “consisting of” formatclaims, such replacements operate to create yet other alternativeembodiments “consisting essentially of” only the elements recited in theoriginal “comprising” embodiment to the exclusion of all other elements.

Moreover, any claim limitation phrased in functional limitation termscovered by 35 USC § 112(6) (post AIA 112(f)) which has a preambleinvoking the closed terms “consisting of,” or “consisting essentiallyof,” should be understood to mean that the corresponding structure(s)disclosed herein define the exact metes and bounds of what the soclaimed invention embodiment(s) consists of, or consisting essentiallyof, to the exclusion of any other elements which do not materiallyaffect the intended purpose of the so claimed embodiment(s).

Devices or system modules that are in at least general communicationwith each other need not be in continuous communication with each other,unless expressly specified otherwise. In addition, devices or systemmodules that are in at least general communication with each other maycommunicate directly or indirectly through one or more intermediaries.Moreover, it is understood that any system components described or namedin any embodiment or claimed herein may be grouped or sub-grouped (andaccordingly implicitly renamed) in any combination or sub-combination asthose skilled in the art can imagine as suitable for the particularapplication, and still be within the scope and spirit of the claimedembodiments of the present invention. For an example of what this means,if the invention was a controller of a motor and a valve and theembodiments and claims articulated those components as being separatelygrouped and connected, applying the foregoing would mean that such aninvention and claims would also implicitly cover the valve being groupedinside the motor and the controller being a remote controller with nodirect physical connection to the motor or internalized valve, as suchthe claimed invention is contemplated to cover all ways of groupingand/or adding of intermediate components or systems that stillsubstantially achieve the intended result of the invention.

A description of an embodiment with several components in communicationwith each other does not imply that all such components are required. Onthe contrary a variety of optional components are described toillustrate the wide variety of possible embodiments of the presentinvention.

As is well known to those skilled in the art many careful considerationsand compromises typically must be made when designing for the optimalmanufacture of a commercial implementation any system, and inparticular, the embodiments of the present invention. A commercialimplementation in accordance with the spirit and teachings of thepresent invention may configured according to the needs of theparticular application, whereby any aspect(s), feature(s), function(s),result(s), component(s), approach(es), or step(s) of the teachingsrelated to any described embodiment of the present invention may besuitably omitted, included, adapted, mixed and matched, or improvedand/or optimized by those skilled in the art, using their average skillsand known techniques, to achieve the desired implementation thataddresses the needs of the particular application.

In the following description and claims, the terms “coupled” and“connected,” along with their derivatives, may be used. It should beunderstood that these terms are not intended as synonyms for each other.Rather, in particular embodiments, “connected” may be used to indicatethat two or more elements are in direct physical or electrical contactwith each other. “Coupled” may mean that two or more elements are indirect physical or electrical contact. However, “coupled” may also meanthat two or more elements are not in direct contact with each other, butyet still cooperate or interact with each other.

A “computer” may refer to one or more apparatus and/or one or moresystems that are capable of accepting a structured input, processing thestructured input according to prescribed rules, and producing results ofthe processing as output. Examples of a computer may include: acomputer; a stationary and/or portable computer; a computer having asingle processor, multiple processors, or multi-core processors, whichmay operate in parallel and/or not in parallel; a general purposecomputer; a supercomputer; a mainframe; a super mini-computer; amini-computer; a workstation; a micro-computer; a server; a client; aninteractive television; a web appliance; a telecommunications devicewith internet access; a hybrid combination of a computer and aninteractive television; a portable computer; a tablet personal computer(PC); a personal digital assistant (PDA); a portable telephone;application-specific hardware to emulate a computer and/or software,such as, for example, a digital signal processor (DSP), afield-programmable gate array (FPGA), an application specific integratedcircuit (ASIC), an application specific instruction-set processor(ASIP), a chip, chips, a system on a chip, or a chip set; a dataacquisition device; an optical computer; a quantum computer; abiological computer; and generally, an apparatus that may accept data,process data according to one or more stored software programs, generateresults, and typically include input, output, storage, arithmetic,logic, and control units.

Those of skill in the art will appreciate that where appropriate, someembodiments of the disclosure may be practiced in network computingenvironments with many types of computer system configurations,including personal computers, hand-held devices, multi-processorsystems, microprocessor-based or programmable consumer electronics,network PCs, minicomputers, mainframe computers, and the like. Whereappropriate, embodiments may also be practiced in distributed computingenvironments where tasks are performed by local and remote processingdevices that are linked (either by hardwired links, wireless links, orby a combination thereof) through a communications network. In adistributed computing environment, program modules may be located inboth local and remote memory storage devices.

“Software” may refer to prescribed rules to operate a computer. Examplesof software may include: code segments in one or more computer-readablelanguages; graphical and or/textual instructions; applets; pre-compiledcode; interpreted code; compiled code; and computer programs.

The example embodiments described herein can be implemented in anoperating environment comprising computer-executable instructions (e.g.,software) installed on a computer, in hardware, or in a combination ofsoftware and hardware. The computer-executable instructions can bewritten in a computer programming language or can be embodied infirmware logic. If written in a programming language conforming to arecognized standard, such instructions can be executed on a variety ofhardware platforms and for interfaces to a variety of operating systems.Although not limited thereto, computer software program code forcarrying out operations for aspects of the present invention can bewritten in any combination of one or more suitable programminglanguages, including an object oriented programming languages and/orconventional procedural programming languages, and/or programminglanguages such as, for example, Hypertext Markup Language (HTML),Dynamic HTML, Extensible Markup Language (XML), Extensible StylesheetLanguage (XSL), Document Style Semantics and Specification Language(DSSSL), Cascading Style Sheets (CSS), Synchronized MultimediaIntegration Language (SMIL), Wireless Markup Language (WML), Java™,Jini™, C, C++, Smalltalk, Perl, UNIX Shell, Visual Basic or Visual BasicScript, Virtual Reality Markup Language (VRML), ColdFusion™ or othercompilers, assemblers, interpreters or other computer languages orplatforms.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

A network is a collection of links and nodes (e.g., multiple computersand/or other devices connected together) arranged so that informationmay be passed from one part of the network to another over multiplelinks and through various nodes. Examples of networks include theInternet, the public switched telephone network, the global Telexnetwork, computer networks (e.g., an intranet, an extranet, a local-areanetwork, or a wide-area network), wired networks, and wireless networks.

The Internet is a worldwide network of computers and computer networksarranged to allow the easy and robust exchange of information betweencomputer users. Hundreds of millions of people around the world haveaccess to computers connected to the Internet via Internet ServiceProviders (ISPs). Content providers (e.g., website owners or operators)place multimedia information (e.g., text, graphics, audio, video,animation, and other forms of data) at specific locations on theInternet referred to as webpages. Websites comprise a collection ofconnected, or otherwise related, webpages. The combination of all thewebsites and their corresponding webpages on the Internet is generallyknown as the World Wide Web (WWW) or simply the Web.

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments. In this regard, each block in the flowchart or blockdiagrams may represent a module, segment, or portion of code, whichcomprises one or more executable instructions for implementing thespecified logical function(s). It should also be noted that, in somealternative implementations, the functions noted in the block may occurout of the order noted in the figures. For example, two blocks shown insuccession may, in fact, be executed substantially concurrently, or theblocks may sometimes be executed in the reverse order, depending uponthe functionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts, or combinations of special purpose hardware andcomputer instructions.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

Further, although process steps, method steps, algorithms or the likemay be described in a sequential order, such processes, methods andalgorithms may be configured to work in alternate orders. In otherwords, any sequence or order of steps that may be described does notnecessarily indicate a requirement that the steps be performed in thatorder. The steps of processes described herein may be performed in anyorder practical. Further, some steps may be performed simultaneously.

It will be readily apparent that the various methods and algorithmsdescribed herein may be implemented by, e.g., appropriately programmedgeneral purpose computers and computing devices. Typically a processor(e.g., a microprocessor) will receive instructions from a memory or likedevice, and execute those instructions, thereby performing a processdefined by those instructions. Further, programs that implement suchmethods and algorithms may be stored and transmitted using a variety ofknown media.

When a single device or article is described herein, it will be readilyapparent that more than one device/article (whether or not theycooperate) may be used in place of a single device/article. Similarly,where more than one device or article is described herein (whether ornot they cooperate), it will be readily apparent that a singledevice/article may be used in place of the more than one device orarticle.

The functionality and/or the features of a device may be alternativelyembodied by one or more other devices which are not explicitly describedas having such functionality/features. Thus, other embodiments of thepresent invention need not include the device itself.

The term “computer-readable medium” as used herein refers to any mediumthat participates in providing data (e.g., instructions) which may beread by a computer, a processor or a like device. Such a medium may takemany forms, including but not limited to, non-volatile media, volatilemedia, and transmission media. Non-volatile media include, for example,optical or magnetic disks and other persistent memory. Volatile mediainclude dynamic random access memory (DRAM), which typically constitutesthe main memory. Transmission media include coaxial cables, copper wireand fiber optics, including the wires that comprise a system bus coupledto the processor. Transmission media may include or convey acousticwaves, light waves and electromagnetic emissions, such as thosegenerated during radio frequency (RF) and infrared (IR) datacommunications. Common forms of computer-readable media include, forexample, a floppy disk, a flexible disk, hard disk, magnetic tape, anyother magnetic medium, a CD-ROM, DVD, any other optical medium, punchcards, paper tape, any other physical medium with patterns of holes, aRAM, a PROM, an EPROM, a FLASH-EEPROM, removable media, flash memory, a“memory stick”, any other memory chip or cartridge, a carrier wave asdescribed hereinafter, or any other medium from which a computer canread.

Various forms of computer readable media may be involved in carryingsequences of instructions to a processor. For example, sequences ofinstruction (i) may be delivered from RAM to a processor, (ii) may becarried over a wireless transmission medium, and/or (iii) may beformatted according to numerous formats, standards or protocols, such asBluetooth, TDMA, CDMA, 3G.

Where databases are described, it will be understood by one of ordinaryskill in the art that (i) alternative database structures to thosedescribed may be readily employed, (ii) other memory structures besidesdatabases may be readily employed. Any schematic illustrations andaccompanying descriptions of any sample databases presented herein areexemplary arrangements for stored representations of information. Anynumber of other arrangements may be employed besides those suggested bythe tables shown. Similarly, any illustrated entries of the databasesrepresent exemplary information only; those skilled in the art willunderstand that the number and content of the entries can be differentfrom those illustrated herein. Further, despite any depiction of thedatabases as tables, an object-based model could be used to store andmanipulate the data types of the present invention and likewise, objectmethods or behaviors can be used to implement the processes of thepresent invention.

A “computer system” may refer to a system having one or more computers,where each computer may include a computer-readable medium embodyingsoftware to operate the computer or one or more of its components.Examples of a computer system may include: a distributed computer systemfor processing information via computer systems linked by a network; twoor more computer systems connected together via a network fortransmitting and/or receiving information between the computer systems;a computer system including two or more processors within a singlecomputer; and one or more apparatuses and/or one or more systems thatmay accept data, may process data in accordance with one or more storedsoftware programs, may generate results, and typically may includeinput, output, storage, arithmetic, logic, and control units.

A “network” may refer to a number of computers and associated devicesthat may be connected by communication facilities. A network may involvepermanent connections such as cables or temporary connections such asthose made through telephone or other communication links. A network mayfurther include hard-wired connections (e.g., coaxial cable, twistedpair, optical fiber, waveguides, etc.) and/or wireless connections(e.g., radio frequency waveforms, free-space optical waveforms, acousticwaveforms, etc.). Examples of a network may include: an internet, suchas the Internet; an intranet; a local area network (LAN); a wide areanetwork (WAN); and a combination of networks, such as an internet and anintranet.

As used herein, the “client-side” application should be broadlyconstrued to refer to an application, a page associated with thatapplication, or some other resource or function invoked by a client-siderequest to the application. A “browser” as used herein is not intendedto refer to any specific browser (e.g., Internet Explorer, Safari,FireFox, or the like), but should be broadly construed to refer to anyclient-side rendering engine that can access and displayInternet-accessible resources. A “rich” client typically refers to anon-HTTP based client-side application, such as an SSH or CFIS client.Further, while typically the client-server interactions occur usingHTTP, this is not a limitation either. The client server interaction maybe formatted to conform to the Simple Object Access Protocol (SOAP) andtravel over HTTP (over the public Internet), FTP, or any other reliabletransport mechanism (such as IBM® MQSeries® technologies and CORBA, fortransport over an enterprise intranet) may be used. Any application orfunctionality described herein may be implemented as native code, byproviding hooks into another application, by facilitating use of themechanism as a plug-in, by linking to the mechanism, and the like.

Exemplary networks may operate with any of a number of protocols, suchas Internet protocol (IP), asynchronous transfer mode (ATM), and/orsynchronous optical network (SONET), user datagram protocol (UDP), IEEE802.x, etc.

Embodiments of the present invention may include apparatuses forperforming the operations disclosed herein. An apparatus may bespecially constructed for the desired purposes, or it may comprise ageneral-purpose device selectively activated or reconfigured by aprogram stored in the device.

Embodiments of the invention may also be implemented in one or acombination of hardware, firmware, and software. They may be implementedas instructions stored on a machine-readable medium, which may be readand executed by a computing platform to perform the operations describedherein.

More specifically, as will be appreciated by one skilled in the art,aspects of the present invention may be embodied as a system, method orcomputer program product. Accordingly, aspects of the present inventionmay take the form of an entirely hardware embodiment, an entirelysoftware embodiment (including firmware, resident software, micro-code,etc.) or an embodiment combining software and hardware aspects that mayall generally be referred to herein as a “circuit,” “module” or“system.” Furthermore, aspects of the present invention may take theform of a computer program product embodied in one or more computerreadable medium(s) having computer readable program code embodiedthereon.

In the following description and claims, the terms “computer programmedium” and “computer readable medium” may be used to generally refer tomedia such as, but not limited to, removable storage drives, a hard diskinstalled in hard disk drive, and the like. These computer programproducts may provide software to a computer system. Embodiments of theinvention may be directed to such computer program products.

An algorithm is here, and generally, considered to be a self-consistentsequence of acts or operations leading to a desired result. Theseinclude physical manipulations of physical quantities. Usually, thoughnot necessarily, these quantities take the form of electrical ormagnetic signals capable of being stored, transferred, combined,compared, and otherwise manipulated. It has proven convenient at times,principally for reasons of common usage, to refer to these signals asbits, values, elements, symbols, characters, terms, numbers or the like.It should be understood, however, that all of these and similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities.

Unless specifically stated otherwise, and as may be apparent from thefollowing description and claims, it should be appreciated thatthroughout the specification descriptions utilizing terms such as“processing,” “computing,” “calculating,” “determining,” or the like,refer to the action and/or processes of a computer or computing system,or similar electronic computing device, that manipulate and/or transformdata represented as physical, such as electronic, quantities within thecomputing system's registers and/or memories into other data similarlyrepresented as physical quantities within the computing system'smemories, registers or other such information storage, transmission ordisplay devices.

Additionally, the phrase “configured to” or “operable for” can includegeneric structure (e.g., generic circuitry) that is manipulated bysoftware and/or firmware (e.g., an FPGA or a general-purpose processorexecuting software) to operate in a manner that is capable of performingthe task(s) at issue. “Configured to” may also include adapting amanufacturing process (e.g., a semiconductor fabrication facility) tofabricate devices (e.g., integrated circuits) that are adapted toimplement or perform one or more tasks.

In a similar manner, the term “processor” may refer to any device orportion of a device that processes electronic data from registers and/ormemory to transform that electronic data into other electronic data thatmay be stored in registers and/or memory. A “computing platform” maycomprise one or more processors.

Embodiments within the scope of the present disclosure may also includetangible and/or non-transitory computer-readable storage media forcarrying or having computer-executable instructions or data structuresstored thereon. Such non-transitory computer-readable storage media canbe any available media that can be accessed by a general purpose orspecial purpose computer, including the functional design of any specialpurpose processor as discussed above. By way of example, and notlimitation, such non-transitory computer-readable media can include RAM,ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storageor other magnetic storage devices, or any other medium which can be usedto carry or store desired program code means in the form ofcomputer-executable instructions, data structures, or processor chipdesign. When information is transferred or provided over a network oranother communications connection (either hardwired, wireless, orcombination thereof) to a computer, the computer properly views theconnection as a computer-readable medium. Thus, any such connection isproperly termed a computer-readable medium. Combinations of the aboveshould also be included within the scope of the computer-readable media.

While a non-transitory computer readable medium includes, but is notlimited to, a hard drive, compact disc, flash memory, volatile memory,random access memory, magnetic memory, optical memory, semiconductorbased memory, phase change memory, optical memory, periodicallyrefreshed memory, and the like; the non-transitory computer readablemedium, however, does not include a pure transitory signal per se; i.e.,where the medium itself is transitory.

An embodiment of the present invention may provide improvedsynchronizing, for at least one frequency hopping transmitter to atleast one frequency hopping receiver wherein designated acquisitionfrequencies and their transmit times may be reduced to a fraction of thepayload frequencies transmit time and interleaved throughout thetransmit hopping pattern, such that hopping synchronization data onthose acquisition channels may be distributed throughout the hop cycle.The receiver scan time and thus delay of synchronization may be reduceddue to the smaller number and shorter transmit duration of theacquisition channels as well as optional repeated identification datasent on the acquisition channels. Furthermore, the receiver may losesynchronization and reestablish synchronization without waiting for afull hopping cycle or restart of transmission from the transmitter.

Furthermore, this invention may provide transmitting durations ofacquisition frequencies based on factors of total payload frequencies.Furthermore, this invention may provide acquisition frequencies whichmay be distributed/interleaved with payload frequencies throughouthopping cycle. Furthermore, this invention may provide variousinterleave patterns which may be created from a single defined ratio.Furthermore, this invention may provide all frequencies which may beused evenly over time. Furthermore, this invention may provide slotswhich may be divided to create simplex, Time Division Duplex, TimeDivision Multiple Access or combination thereof without affecting ratio,balance or interleaving pattern. Furthermore, this invention may providetransmitting hopping synchronization on short duration acquisitionchannels to maximize throughput of payload channels. Furthermore, thisinvention may provide transmission of a first repeating network ID datasequence on acquisition frequencies followed by an optional longertypically more detailed or specific non-repeating network ID datasequence. Furthermore, this invention may provide a receiver scan dwelltime formula and sequence that may minimize receiver dwell time andchances of missed acquisition data.

Although for the following figures only one interleave, timing andfrequency pattern will be described in detail for use in five differentsystem types (half duplex, half duplex time division multiple access,time division duplex, time division duplex with time division multipleaccess and repeater bridge), many timing and interleave patterns andmodes of operation as well as various modifications and improvementsrelative to system requirements can be made by a person skilled in theart without departing from the scope of the present invention.

FIGS. 1A and 1B are flow charts illustrating an exemplary process todetermine a hopping interleave ratio and timing to be implemented withina logic section of a radio transmitter, receiver, transceiver orrepeater device, where 1B is a continuation of 1A, in accordance with anembodiment of the invention. Those skilled in the art will appreciatethat the exemplary steps and flow show may be altered depending upon theneeds of the particular application, and in light of the teachings ofthe present invention. By way of example, and not limitation, steps in1A and 1B may be reordered and the output parameters, tests and inputparameters may be swapped depending, at least part, on what the knownfactors are from the system designer's point of view. For example,without limitation, from a regulatory compliance standpoint a designermight use FIGS. 1A & 1B as illustrated with inputs being “TotalFrequencies” and maximum allowed “Payload Time Slot Duration”. However,from an efficiency standpoint the inputs could be “Total Hop Slots” and“Acquisition Time Factor” with “Total Frequencies” and maximum allowed“Payload Time Slot Duration” being some of the output variables. Thoseskilled in the art will readily recognize the right balance betweenthese, and other, trade-off considerations depending upon the needs ofthe particular application. While it would not be practical or necessaryto illustrate the wide combinatorial diversity of input and outputoptions along with possible reordering of steps, a helpful guidance forthe system designer to consider is that many practical alternatives tothe present embodiment may be created that generally have formula/steps,which generate fractional times and subgroups of frequencies(acquisition) whose transmit duration and quantity are paired factors ofthe payload transmit duration and quantity of payload frequenciesresulting in equal transmission (use) on all frequencies upon completinga full hop cycle (all hop acquisition and payload slots have beentransmitted once without repeating or duplication). With reference toFIG. 1A, in a Step 105 the quantity of acquisition frequencies may beset to one. Many practical embodiments of the present invention shouldhave at least one Acquisition frequency assigned. In FIGS. 1A and 1Bthere are two places where the number of acquisition frequencies isreset to the minimum of 1. In a Step 110 a minimum of 1 and maximum of1,000,000 quantity of total frequencies may be selected, a minimum of 1and a maximum of 60,000 for the acquisition time factor may be selected,and a payload time slot duration of 0.2 milliseconds to 120,000milliseconds may be entered. In a Step 115 the quantity of totalfrequencies may be set to the minimum quantity of total frequenciesentered from a Step 110. In Step 120 the acquisition time factor may beset to the minimum acquisition time factor entered from a Step 120. In aStep 125 total frequencies may be tested to see if they have exceededthe maximum total frequencies, if they have passed, In a Step 135 theremaining channels may be calculated to be payload channels, wherepayload frequencies may be equal to the total frequencies minus theacquisition frequencies. In a Step 140 the number of acquisitionfrequencies may be tested to not exceed or equal the number of payloadfrequencies. If the test fails the acquisition frequencies may be reset145 and the quantity of total frequencies may be incremented by 1 150and return to Step 120. If Step 140 passes, in a Step 155 the number ofacquisition frequencies may be tested to be a factor of the number ofpayload frequencies in the hopset. If the test fails the quantity ofacquisition frequencies may be incremented by 1 160 and Step 135 may berepeated.

With reference to FIGS. 1A and 1B, if test FIG. 1A 155 passes thenthrough FIG. 1A's and 1B's 165 in FIG. 1B a Step 175 the acquisitiontime factor may be tested to not exceed maximum selected acquisitiontime factor. With reference to FIGS. 1A and 1B, if FIG. 1B 175 fails theacquisition time factor may be reset to minimum acquisition time factorin a Step 180, and through FIGS. 1A and 1B 170 the quantity ofacquisition frequencies may be incremented by 1 in FIG. 1A Step 160. Ina Step 185 payload frequencies may be divided by the product ofmultiplying the acquisition frequencies and acquisition time to test ifthey factor. If test 185 fails, the acquisition time factor may beincremented by 1 190 and Step 175 may be repeated. If test 185 passes,in a Step 195 a payload time slot duration may be divided by theacquisition time factor to obtain the acquisition time slot duration. Ina Step 196 the number of acquisition frequencies may then be multipliedby the acquisition time factor to obtain the total number of acquisitiontime slots. In a Step 197 the interleave ratio may be determined by theacquisition time slots compared to the payload frequencies. In a Step198 the total number of payload frequencies may be added to the totalnumber of acquisition time slots to become the total number of hop slotsin the hop cycle. The total hop slots, interleave ratio, totalfrequencies, payload frequencies and any optional other data calculatedmay then all be stored onto database 199 and used to form one possiblehopping sequence and timing solution. The acquisition time factor maythen be incremented by 1 in a Step 190 and Step 175 may be repeated. Itmay be appreciated that many such combinations may be generateddepending on input parameters for consideration based on unique systemrequirements. Using this formula and block diagram it may show that manydifferent patterns, ratios and timings may be output for use in themethod and implemented according to best choice for a given system.

With reference to FIGS. 1A, 1B and 2, FIG. 2 illustrates an exemplarypossible hopping pattern resulting from the steps in FIGS. 1A and 1B, inaccordance with an embodiment of the invention. With reference to FIGS.1A and 1B, it will be appreciated that the steps in FIGS. 1A and 1B maycreate numerous possibilities that may fall within the scope of thepresent invention, from which an optimum configuration may be chosenbased on individual system requirements including, without limitation,balancing trade-offs between speed of synchronization/re-synchronizationvs acquisition slot robustness vs payload throughput efficiency vstransmission channel bandwidth vs regulatory requirements; therefore, apattern representing a ratio of one acquisition to two payloadstructured as two acquisition slots followed by four payload slots witha payload slot duration of 400 ms 205 and an acquisition slot durationof 66.6 ms 200 is shown as an example. With reference to FIGS. 1A and1B, the ratio and hop slots from the steps in FIGS. 1A and 1B may beused to form interleaved frames consisting of acquisition slots asdepicted 200 and payload slots as depicted 205 which may be contiguouslyconnected to become a hop cycle. The hop cycle may be complete and maybe re-cycled when all hop slots have been transmitted. The acquisitionslots 200 & 205 may be ordered within the frames and cycle usingtechniques so that maximum frequency diversity may occur with regards toadjacent slots 210. sequential, random, Psuedorandom or any other nonsequential ordering methods may also be used when ordering acquisitionslots, payload or both depending on system requirements as regulatoryand encryption/security. Acquisition frequencies 200 may be repeatedthroughout the hop cycle while payload frequencies 205 may betransmitted only once per hop cycle.

FIG. 3A illustrates an exemplary block diagram of data transmittedwithin a typical acquisition slot, in accordance with an embodiment ofthe invention. A first identifying data sequence from 2 to 500 bits long300 may be sent repetitively for at least a minimum duration as definedby receiver detect time plus receiver blank or tune time (hardwarelimited) multiplied by the total number of acquisition frequencies in ahop cycle 315. This may be followed by an optional second identifyingdata sequence 4 to 1000 bits long 305, which may be followed by hoppingsynchronization data 310. It should be noted that while identifying datasequence 305 is optional in many practical applications it may beimportant for useful operation, first identifying data sequence 300/315and hop cycle 310 may particularly important to proper functioning.

FIG. 3B illustrates an exemplary flowchart for receiver scanning of thetransmitted acquisition channels and subsequent synchronization, inaccordance with an embodiment of the invention. With reference to FIGS.1A, 1B, and 3A, in a Step 320 the receiver may scan acquisitionfrequency(ies) as determined in FIGS. 1A and 1B. In Step 320, a receivermay scan each acquisition frequency monitoring for a first dwellduration from 0.5 to 2.5 times the transmit duration of a singleinstance of the first identifying data sequence from 300 sufficient to,at a minimum have a 50% or higher probability of detecting a match ofthe first network identification data sequence. In a Step 325 if at theend of monitoring the first dwell duration no valid network data hasbeen detected, a next acquisition frequency may be monitored, then whenall frequencies are scanned a scanning cycle Step 320 may be repeated.In Step 325 if a valid network identification has been detected, then ina Step 330 data reception may be continued on same frequency and if theoptional second network identification sequence is implemented—optionalsecond network identification matching data sequence and hoppingsynchronization data may be received. In a Step 335 if an optionalsecond network identification matching data sequence or hoppingsynchronization data is not received within a preset second dwellduration from 0.5 to 2.5 times the transmit duration of the secondidentifying data sequence from 305 sufficient to, at a minimum manypractical applications have a 50% or higher probability of detecting amatch of the optional second network identification data sequence, thenacquisition frequency scanning may be resumed and Step 320 is repeated.In a Step 335, if an optional second network identification matchingdata sequence and or hopping synchronization data is determined to bevalid before the preset dwell time expires, then a controller mayreconstruct a hopping pattern and all elements necessary to synchronizewith a transmitter from either the data received on the acquisitionchannel or from its own presets in memory or from a combination of both.In a Step 340, a receiver may begin to synchronize reception on payloadchannels. payload slots may optionally include a network identificationdata sequence as well as other overhead/control information depending ontrade-offs between bandwidth efficiency vs network security andrequirements for additional overhead. In many practical applications,synchronization loss may be set from a minimum of missing 1 payload slotup to a maximum of missing 1000 payload slots or corresponding durationdepending on a trade-off between synchronization loss tenacity vs speedof re-acquisition. If synchronization is lost due to termination oftransmission or end of transmission data sequence sent from transmittingdevice, loss of payload or acquisition slot data decoding and subsequenttimeout, hardware failure or user intervention, the receiver may revertback to scanning the acquisition frequencies and Step 320 may berepeated.

FIG. 4A illustrates an exemplary block diagram embodiment of a hoppingpattern used in half duplex communications with correspondingtransmission signal flow, in accordance with an embodiment of theinvention. Synchronization may be established as described above viaacquisition slots 410 only one received acquisition slot is necessary tobe received for synchronization to occur. A transmit hopping pattern 400may be continued until all hop slots have been utilized and repeated ifnecessary until transmission is terminated. Once synchronized, areceiver may hop in time with transmitted payload slots 405. Whilehopping is synchronized, the receiver may tune in time with the transmitpayload slots 405. It may not be required that the receiver tune toacquisition slots 410 once synchronization is established.

FIG. 4B illustrates exemplary user level radio transceivers utilizingthe invention, in accordance with an embodiment of the invention. Withreference to FIGS. 1A to 4A, FIG. 4B illustrates the methods describedin FIGS. 1A to 4A applied to transmissions of half duplex communications415 and reception 420 as well as simultaneous multi-unit reception 425.

With reference to FIGS. 1A to 3B and FIG. 5A, FIG. 5A illustrates anexemplary block diagram of a single frame according to the method asdescribed in the detailed descriptions for FIGS. 1A to 3B whenimplemented in a half duplex 2 position time division multiple accessconfiguration, in accordance with an embodiment of the invention. Withreference to FIGS. 1A to 3B, transmit hop slots 505 according to thedetailed descriptions of FIGS. 1A to 3B, may be partitioned intomultiple access time slots 510 by dividing a transmit duration within ahop slot by a number of multiple access slots desired from 2 to 1000.With reference to FIGS. 1A to 3B and 5A, receive hop slots 515 accordingto the detailed descriptions of FIGS. 1A to 3B may be partitioned intomultiple access time slots 520 by dividing the transmit duration withinthe hop slot by the number of multiple access slots matching thetransmitter slots 510 from 2 to 1000. Optional detection of the multipleaccess slot position transmission in use by the other in range multipleaccess transceiver's receivers using the same hop set with differentnetwork or system identification addressing may enable them toautomatically select and transmit on an available multiple access slotas a further interference mitigation without userintervention/selection.

With reference to FIGS. 5A and 5B, FIG. 5B illustrates exemplary radiotransceivers implementing the method described in FIG. 5A, in accordancewith an embodiment of the invention. Frequency hopping time divisionmultiple access half duplex transmissions from separate transmitters ontwo distinct multiple access time slots 525 may be received on theirrespective multiple access time slots 530.

With reference to FIGS. 1 to 3B, and 6A, FIG. 6A illustrate an exemplaryblock diagram embodiment of one single hop frame showing time,frequencies, and signal direction for a transmitter, repeater andreceiver utilizing the method as described in FIGS. 1A to 3B within atime division duplex system, in accordance with an embodiment of theinvention. With reference to FIGS. 1A, 1B, and 6A, for time divisionduplex operation each slot in the hopping pattern as determined fromFIGS. 1A and 1B may be divided to create separate time division duplex,transmit and receive sub-slots as depicted in FIG. 6A items 600, 610,and 620. The transmit and receive time division duplex sub-slotfunctions may be reversed in time in a repeater 610 with reference to atransmitter 600 and a receiver 620 causing a time division duplex effectshown in the signal direction between the transmitter 600 and a repeater605 and repeater to a receiver 620 in 615. The receiver 620, may receivetransmissions from the repeater transmit slots 615 and optionally mayreceive transmissions from the transmitter transmit slots 600 in orderto switch to the strongest signal based on RSSI or slot misses, forexample, without limitation, if repeater 610 is out of range butTransmitter 600 is in range or vice versa. The transmitting transceiver600 may optionally receive transmissions from the repeater transmitslots 625 during a receive slot window.

With reference to FIGS. 6A and 6B, FIG. 6B illustrates exemplary radiotransceivers implementing the method described in FIG. 6A, in accordancewith an embodiment of the invention. Frequency hopping time divisionduplex transmissions from a transmitter 630 may be received by arepeater 635. The repeater 635 then may re-transmit to receiver/s 640and optionally back to the transmitting transceivers receiver 630.

With reference to FIGS. 1A to 3B and 7A, FIG. 7A illustrate an exemplaryblock diagram of a single hop frame showing time, frequencies, andsignal direction for two distinct transmitters, one repeater and twodistinct receivers utilizing the method as described in the detaileddescriptions for FIGS. 1A to 3B above within a two-channel time divisionduplex and multiple access system, in accordance with an embodiment ofthe invention. With reference to FIGS. 1A, 1B, and 7A, for time divisionduplex with multiple access operation each slot in a hopping pattern asdetermined from FIGS. 1A and 1B may be divided to create separate timedivision duplex slots 700, 715, and 730 which may be further partitionedto create multiple access slots 705, 720, and 735. Transmit and receivetime division duplex slot functions may be reversed in time in arepeater 715 with reference to a transmitter and a receiver, 700 and730, causing a time division duplex effect shown in the signal directionbetween the transmitter and a repeater in 710 and a repeater to receiverin 725. Each multiple access transmitter slot from 2 up to 1000 705 maybe received by a corresponding repeater multiple access slot matchingthe transmitter multiple access slots from 2 up to 1000 705 which maythen be transmitted from the repeater on a corresponding time slots 710and 725. Each receiver may receive transmissions from the repeatertransmit slots on its assigned multiple access time slots matching thetransmitter 705 and repeater 720 multiple access slots from 2 up to 1000735. Each transmitting transceiver may optionally receive transmissionsfrom the repeater transmit slots on its assigned multiple access timeslot 710 and optionally may receive transmissions from the transmittertransmit slots 700 and matching transmitter multiple access slots from 2up to 1000 705 in order to switch to the strongest signal based on RSSIor slot misses, for example if repeater 715 is out of range butTransmitter 700 is in range or vice versa.

With reference to FIGS. 7A and 7B, FIG. 7B shows exemplary radiotransceivers implementing the method described in 7A, in accordance withan embodiment of the invention. Frequency hopping time division duplexwith multiple access transmissions from slot 1 and or slot 2transceiver/transmitter 740 may be received by a repeater 745 during therepeater's time division duplex receive window on their respectivemultiple access time slots. The repeater 745 then may re-transmit datato the transceiver/receiver/s 750 during the transceiver time divisionduplex receive window on their respective multiple access time slot andoptionally back to the transmitting transceivers receiver 740.

With reference to FIGS. 6A and 7A a repeater bridge is possible byre-transmitting received data during the receivers (transceiver) 620 or730 idle slot either on the same hopset frequencies or separate hopsetfrequencies depending on interference potential and regulatoryrequirements, turning the receiver into a bridged/networked repeaterwithout the need for external back-haul equipment. In this way repeaterscan be configured in daisy chain or star networks or a combination ofboth, allowing subscriber transceivers to communicate seamlessly whilein range of different repeaters without the need for additionalback-haul equipment.

FIG. 8 illustrates an exemplary software system modules architecturediagram, in accordance with an embodiment of the invention. A MobileDevice 805 may initiate communication by sending a communication signalto a local base station, Base Station-1 810. Base station-1 810 mayaccess a Backhaul Network Database-1 815 in order to determine how toprocess the communication signal and look up relevant data needed topass on the communication signal. The communication signal may be sentto a destination base station, Base Station-2 820, nearest to adestination mobile device, Mobile Device-2 830. Base Station-2 820 mayaccess a local Backhaul Network Database-2 825 in order to determine howto process the communication signal and look up relevant data needed topass on the communication signal. Finally, a destination mobile device,Mobile Device-2 830 may receive the signal sent by Mobile Device-1 805.

FIG. 9 illustrates a block diagram depicting a conventionalclient/server communication system, which may be used by an exemplaryweb-enabled/networked embodiment of the present invention.

A communication system 900 includes a multiplicity of networked regionswith a sampling of regions denoted as a network region 902 and a networkregion 904, a global network 906 and a multiplicity of servers with asampling of servers denoted as a server device 908 and a server device910.

Network region 902 and network region 904 may operate to represent anetwork contained within a geographical area or region. Non-limitingexamples of representations for the geographical areas for the networkedregions may include postal zip codes, telephone area codes, states,counties, cities and countries. Elements within network region 902 and904 may operate to communicate with external elements within othernetworked regions or within elements contained within the same networkregion.

In some implementations, global network 906 may operate as the Internet.It will be understood by those skilled in the art that communicationsystem 900 may take many different forms. Non-limiting examples of formsfor communication system 900 include local area networks (LANs), widearea networks (WANs), wired telephone networks, cellular telephonenetworks, land mobile radio networks or any other network supportingdata communication between respective entities via hardwired or wirelesscommunication networks. Global network 906 may operate to transferinformation between the various networked elements.

Server device 908 and server device 910 may operate to execute softwareinstructions, store information, support database operations andcommunicate with other networked elements. Non-limiting examples ofsoftware and scripting languages which may be executed on server device908 and server device 910 include C, C++, C# and Java.

Network region 902 may operate to communicate bi-directionally withglobal network 906 via a communication channel 912. Network region 904may operate to communicate bi-directionally with global network 906 viaa communication channel 914. Server device 908 may operate tocommunicate bi-directionally with global network 906 via a communicationchannel 916. Server device 910 may operate to communicatebi-directionally with global network 906 via a communication channel918. Network region 902 and 904, global network 906 and server devices908 and 910 may operate to communicate with each other and with everyother networked device located within communication system 900.

Server device 908 includes a networking device 920 and a server 922.Networking device 920 may operate to communicate bi-directionally withglobal network 906 via communication channel 916 and with server 922 viaa communication channel 924. Server 922 may operate to execute softwareinstructions and store information.

Network region 902 includes a multiplicity of clients with a samplingdenoted as a client 926 and a client 928. Client 926 includes anetworking device 934, a processor 936, a GUI 938 and an interfacedevice 940. Non-limiting examples of devices for GUI 938 includemonitors, televisions, cellular telephones, smartphones and PDAs(Personal Digital Assistants). Non-limiting examples of interface device940 include pointing device, mouse, trackball, scanner and printer.Networking device 934 may communicate bi-directionally with globalnetwork 906 via communication channel 912 and with processor 936 via acommunication channel 942. GUI 938 may receive information fromprocessor 936 via a communication channel 944 for presentation to a userfor viewing. Interface device 940 may operate to send controlinformation to processor 936 and to receive information from processor936 via a communication channel 946. Network region 904 includes amultiplicity of clients with a sampling denoted as a client 930 and aclient 932. Client 930 includes a networking device 948, a processor950, a GUI 952 and an interface device 954. Non-limiting examples ofdevices for GUI 938 include monitors, televisions, cellular telephones,smartphones and PDAs (Personal Digital Assistants). Non-limitingexamples of interface device 940 include pointing devices, mousse,trackballs, scanners and printers. Networking device 948 may communicatebi-directionally with global network 906 via communication channel 914and with processor 950 via a communication channel 956. GUI 952 mayreceive information from processor 950 via a communication channel 958for presentation to a user for viewing. Interface device 954 may operateto send control information to processor 950 and to receive informationfrom processor 950 via a communication channel 960.

For example, consider the case where a user interfacing with client 926may want to execute a networked application. A user may enter the IP(Internet Protocol) address for the networked application usinginterface device 940. The IP address information may be communicated toprocessor 936 via communication channel 946. Processor 936 may thencommunicate the IP address information to networking device 934 viacommunication channel 942. Networking device 934 may then communicatethe IP address information to global network 906 via communicationchannel 912. Global network 906 may then communicate the IP addressinformation to networking device 920 of server device 908 viacommunication channel 916. Networking device 920 may then communicatethe IP address information to server 922 via communication channel 924.Server 922 may receive the IP address information and after processingthe IP address information may communicate return information tonetworking device 920 via communication channel 924. Networking device920 may communicate the return information to global network 906 viacommunication channel 916. Global network 906 may communicate the returninformation to networking device 934 via communication channel 912.Networking device 934 may communicate the return information toprocessor 936 via communication channel 942. Processor 976 maycommunicate the return information to GUI 978 via communication channel944. User may then view the return information on GUI 938.

Those skilled in the art will readily recognize, in light of and inaccordance with the teachings of the present invention, that any of theforegoing steps and/or system modules may be suitably replaced,reordered, removed and additional steps and/or system modules may beinserted depending upon the needs of the particular application, andthat the systems of the foregoing embodiments may be implemented usingany of a wide variety of suitable processes and system modules, and isnot limited to any particular computer hardware, software, middleware,firmware, microcode and the like. For any method steps described in thepresent application that can be carried out on a computing machine, atypical computer system can, when appropriately configured or designed,serve as a computer system in which those aspects of the invention maybe embodied.

FIG. 10 is a block diagram depicting an exemplary client/server systemwhich may be used by an exemplary web-enabled/networked embodiment ofthe present invention.

A communication system 1000 includes a multiplicity of clients with asampling of clients denoted as a client 1002 and a client 1004, amultiplicity of local networks with a sampling of networks denoted as alocal network 1006 and a local network 1008, a global network 1010 and amultiplicity of servers with a sampling of servers denoted as a server1012 and a server 1014.

Client 1002 may communicate bi-directionally with local network 1006 viaa communication channel 1016. Client 1004 may communicatebi-directionally with local network 1008 via a communication channel1018. Local network 1006 may communicate bi-directionally with globalnetwork 1010 via a communication channel 1020. Local network 1008 maycommunicate bi-directionally with global network 1010 via acommunication channel 1022. Global network 1010 may communicatebi-directionally with server 1012 and server 1014 via a communicationchannel 1024. Server 1012 and server 1014 may communicatebi-directionally with each other via communication channel 1024.Furthermore, clients 1002, 1004, local networks 1006, 1008, globalnetwork 1010 and servers 1012, 1014 may each communicatebi-directionally with each other.

In one embodiment, global network 1010 may operate as the Internet. Itwill be understood by those skilled in the art that communication system1000 may take many different forms. Non-limiting examples of forms forcommunication system 1000 include local area networks (LANs), wide areanetworks (WANs), wired telephone networks, wireless networks, or anyother network supporting data communication between respective entities.

Clients 1002 and 1004 may take many different forms. Non-limitingexamples of clients 1002 and 1004 include personal computers, personaldigital assistants (PDAs), cellular phones and smartphones.

Client 1002 includes a CPU 1026, a pointing device 1028, a keyboard1030, a microphone 1032, a printer 1034, a memory 1036, a mass memorystorage 1038, a GUI 1040, a video camera 1042, an input/output interface1044 and a network interface 1046.

CPU 1026, pointing device 1028, keyboard 1030, microphone 1032, printer1034, memory 1036, mass memory storage 1038, GUI 1040, video camera1042, input/output interface 1044 and network interface 1046 maycommunicate in a unidirectional manner or a bi-directional manner witheach other via a communication channel 1048. Communication channel 1048may be configured as a single communication channel or a multiplicity ofcommunication channels.

CPU 1026 may be comprised of a single processor or multiple processors.CPU 1026 may be of various types including micro-controllers (e.g., withembedded RAM/ROM) and microprocessors such as programmable devices(e.g., RISC or SISC based, or CPLDs and FPGAs) and devices not capableof being programmed such as gate array ASICs (Application SpecificIntegrated Circuits) or general purpose microprocessors.

As is well known in the art, memory 1036 is used typically to transferdata and instructions to CPU 1026 in a bi-directional manner. Memory1036, as discussed previously, may include any suitablecomputer-readable media, intended for data storage, such as thosedescribed above excluding any wired or wireless transmissions unlessspecifically noted. Mass memory storage 1038 may also be coupledbi-directionally to CPU 1026 and provides additional data storagecapacity and may include any of the computer-readable media describedabove. Mass memory storage 1038 may be used to store programs, data andthe like and is typically a secondary storage medium such as a harddisk. It will be appreciated that the information retained within massmemory storage 1038, may, in appropriate cases, be incorporated instandard fashion as part of memory 1036 as virtual memory.

CPU 1026 may be coupled to GUI 1040. GUI 1040 enables a user to view theoperation of computer operating system and software. CPU 1026 may becoupled to pointing device 1028. Non-limiting examples of pointingdevice 1028 include computer mouse, trackball and touchpad. Pointingdevice 1028 enables a user with the capability to maneuver a computercursor about the viewing area of GUI 1040 and select areas or featuresin the viewing area of GUI 1040. CPU 1026 may be coupled to keyboard1030. Keyboard 1030 enables a user with the capability to inputalphanumeric textual information to CPU 1026. CPU 1026 may be coupled tomicrophone 1032. Microphone 1032 enables audio produced by a user to berecorded, processed and communicated by CPU 1026. CPU 1026 may beconnected to printer 1034. Printer 1034 enables a user with thecapability to print information to a sheet of paper. CPU 1026 may beconnected to video camera 1042. Video camera 1042 enables video producedor captured by user to be recorded, processed and communicated by CPU1026.

CPU 1026 may also be coupled to input/output interface 1044 thatconnects to one or more input/output devices such as such as CD-ROM,video monitors, track balls, mice, keyboards, microphones,touch-sensitive displays, transducer card readers, magnetic or papertape readers, tablets, styluses, voice or handwriting recognizers, orother well-known input devices such as, of course, other computers.

Finally, CPU 1026 optionally may be coupled to network interface 1046which enables communication with an external device such as a databaseor a computer or telecommunications or internet network using anexternal connection shown generally as communication channel 1016, whichmay be implemented as a hardwired or wireless communications link usingsuitable conventional technologies. With such a connection, CPU 1026might receive information from the network, or might output informationto a network in the course of performing the method steps described inthe teachings of the present invention.

It will be further apparent to those skilled in the art that at least aportion of the novel method steps and/or system components of thepresent invention may be practiced and/or located in location(s)possibly outside the jurisdiction of the United States of America (USA),whereby it will be accordingly readily recognized that at least a subsetof the novel method steps and/or system components in the foregoingembodiments must be practiced within the jurisdiction of the USA for thebenefit of an entity therein or to achieve an object of the presentinvention. Thus, some alternate embodiments of the present invention maybe configured to comprise a smaller subset of the foregoing means forand/or steps described that the applications designer will selectivelydecide, depending upon the practical considerations of the particularimplementation, to carry out and/or locate within the jurisdiction ofthe USA. For example, any of the foregoing described method steps and/orsystem components which may be performed remotely over a network (e.g.,without limitation, a remotely located server) may be performed and/orlocated outside of the jurisdiction of the USA while the remainingmethod steps and/or system components (e.g., without limitation, alocally located client) of the forgoing embodiments are typicallyrequired to be located/performed in the USA for practicalconsiderations. In client-server architectures, a remotely locatedserver typically generates and transmits required information to a USbased client, for use according to the teachings of the presentinvention. Depending upon the needs of the particular application, itwill be readily apparent to those skilled in the art, in light of theteachings of the present invention, which aspects of the presentinvention can or should be located locally and which can or should belocated remotely. Thus, for any claims construction of the followingclaim limitations that are construed under 35 USC § 112 (6) it isintended that the corresponding means for and/or steps for carrying outthe claimed function are the ones that are locally implemented withinthe jurisdiction of the USA, while the remaining aspect(s) performed orlocated remotely outside the USA are not intended to be construed under35 USC § 112 (6).

It is noted that according to USA law, all claims must be set forth as acoherent, cooperating set of limitations that work in functionalcombination to achieve a useful result as a whole. Accordingly, for anyclaim having functional limitations interpreted under 35 USC § 112 (6)where the embodiment in question is implemented as a client-serversystem with a remote server located outside of the USA, each suchrecited function is intended to mean the function of combining, in alogical manner, the information of that claim limitation with at leastone other limitation of the claim. For example, in client-server systemswhere certain information claimed under 35 USC § 112 (6) is/(are)dependent on one or more remote servers located outside the USA, it isintended that each such recited function under 35 USC § 112 (6) is to beinterpreted as the function of the local system receiving the remotelygenerated information required by a locally implemented claimlimitation, wherein the structures and or steps which enable, andbreathe life into the expression of such functions claimed under 35 USC§ 112 (6) are the corresponding steps and/or means located within thejurisdiction of the USA that receive and deliver that information to theclient (e.g., without limitation, client-side processing andtransmission networks in the USA). When this application is prosecutedor patented under a jurisdiction other than the USA, then “USA” in theforegoing should be replaced with the pertinent country or countries orlegal organization(s) having enforceable patent infringementjurisdiction over the present application, and “35 USC § 112 (6)” shouldbe replaced with the closest corresponding statute in the patent laws ofsuch pertinent country or countries or legal organization(s).

All the features disclosed in this specification, including anyaccompanying abstract and drawings, may be replaced by alternativefeatures serving the same, equivalent or similar purpose, unlessexpressly stated otherwise. Thus, unless expressly stated otherwise,each feature disclosed is one example only of a generic series ofequivalent or similar features.

It is noted that according to USA law 35 USC § 112 (1), all claims mustbe supported by sufficient disclosure in the present patentspecification, and any material known to those skilled in the art neednot be explicitly disclosed. However, 35 USC § 112 (6) requires thatstructures corresponding to functional limitations interpreted under 35USC § 112 (6) must be explicitly disclosed in the patent specification.Moreover, the USPTO's Examination policy of initially treating andsearching prior art under the broadest interpretation of a “mean for” or“steps for” claim limitation implies that the broadest initial search on35 USC § 112(6) (post AIA 112(f)) functional limitation would have to beconducted to support a legally valid Examination on that USPTO policyfor broadest interpretation of “mean for” claims. Accordingly, the USPTOwill have discovered a multiplicity of prior art documents includingdisclosure of specific structures and elements which are suitable to actas corresponding structures to satisfy all functional limitations in thebelow claims that are interpreted under 35 USC § 112(6) (post AIA112(f)) when such corresponding structures are not explicitly disclosedin the foregoing patent specification. Therefore, for any inventionelement(s)/structure(s) corresponding to functional claim limitation(s),in the below claims interpreted under 35 USC § 112(6) (post AIA 112(f)),which is/are not explicitly disclosed in the foregoing patentspecification, yet do exist in the patent and/or non-patent documentsfound during the course of USPTO searching, Applicant(s) incorporate allsuch functionally corresponding structures and related enabling materialherein by reference for the purpose of providing explicit structuresthat implement the functional means claimed. Applicant(s) request(s)that fact finders during any claims construction proceedings and/orexamination of patent allowability properly identify and incorporateonly the portions of each of these documents discovered during thebroadest interpretation search of 35 USC § 112(6) (post AIA 112(f))limitation, which exist in at least one of the patent and/or non-patentdocuments found during the course of normal USPTO searching and orsupplied to the USPTO during prosecution. Applicant(s) also incorporateby reference the bibliographic citation information to identify all suchdocuments comprising functionally corresponding structures and relatedenabling material as listed in any PTO Form-892 or likewise anyinformation disclosure statements (IDS) entered into the present patentapplication by the USPTO or Applicant(s) or any 3^(rd) parties.Applicant(s) also reserve its right to later amend the presentapplication to explicitly include citations to such documents and/orexplicitly include the functionally corresponding structures which wereincorporate by reference above.

Thus, for any invention element(s)/structure(s) corresponding tofunctional claim limitation(s), in the below claims, that areinterpreted under 35 USC § 112(6) (post AIA 112(f)), which is/are notexplicitly disclosed in the foregoing patent specification, Applicant(s)have explicitly prescribed which documents and material to include theotherwise missing disclosure, and have prescribed exactly which portionsof such patent and/or non-patent documents should be incorporated bysuch reference for the purpose of satisfying the disclosure requirementsof 35 USC § 112 (6). Applicant(s) note that all the identified documentsabove which are incorporated by reference to satisfy 35 USC § 112 (6)necessarily have a filing and/or publication date prior to that of theinstant application, and thus are valid prior documents to incorporatedby reference in the instant application.

Having fully described at least one embodiment of the present invention,other equivalent or alternative methods of implementing radiocommunication according to the present invention will be apparent tothose skilled in the art. Various aspects of the invention have beendescribed above by way of illustration, and the specific embodimentsdisclosed are not intended to limit the invention to the particularforms disclosed. The particular implementation of the radiocommunication may vary depending upon the particular context orapplication. By way of example, and not limitation, the radiocommunication described in the foregoing were principally directed toradio communication synchronization implementations; however, similartechniques may instead be applied to RF integrated circuits, RF systemon a chip, smart phone or computer programs, firmware and applications,cordless telephones, wireless alarm systems, two way radio hardware andsoftware, telemetry and SCADA devices, cellular telephone hardware andsoftware, wireless headset hardware and software, remote controldevices, remote audio devises, internet-of-things devices, wirelesstransmitters/receivers/transceivers/repeaters, access points andbridges, vehicular repeaters, which implementations of the presentinvention are contemplated as within the scope of the present invention.The invention is thus to cover all modifications, equivalents, andalternatives falling within the spirit and scope of the followingclaims. It is to be further understood that not all of the disclosedembodiments in the foregoing specification will necessarily satisfy orachieve each of the objects, advantages, or improvements described inthe foregoing specification.

Claim elements and steps herein may have been numbered and/or letteredsolely as an aid in readability and understanding. Any such numberingand lettering in itself is not intended to and should not be taken toindicate the ordering of elements and/or steps in the claims.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

The Abstract is provided to comply with 37 C.F.R. Section 1.72(b)requiring an abstract that will allow the reader to ascertain the natureand gist of the technical disclosure. That is, the Abstract is providedmerely to introduce certain concepts and not to identify any key oressential features of the claimed subject matter. It is submitted withthe understanding that it will not be used to limit or interpret thescope or meaning of the claims.

The following claims are hereby incorporated into the detaileddescription, with each claim standing on its own as a separateembodiment.

What is claimed is:
 1. A method of synchronizing frequency hoppingtransmitters, receivers, transceivers, repeaters and other radionetworks utilizing non-coordinated shared frequencies within regional,US and international ISM (Industrial, Scientific and Medical) bandscomprising: Synchronizing communications between at least onetransmitting and at least one receiving device utilizing a pool offrequencies consisting of a first group of frequencies being assigned totransmit for a specific duration per frequency per transmission and asecond group of frequencies in which the total number of frequencies isa paired first factor of the first group's total number of frequenciesor a paired first factor of any factor of the first group's total numberof frequencies and which is then divided into transmit slots, theduration being a fraction of the first groups transmit duration and alsobeing the corresponding paired second factor of the first groups totalnumber of frequencies or a corresponding paired second factor of afactor of the first group's total number of frequencies according towhich product was chosen to calculate the first factor.
 2. The method ofclaim 1, further comprising the step of calculating a ratio bymultiplying the two factors used to determine the slots for the secondgroup of frequencies (total number of frequencies and transmit durationdivisor) compared to the number of frequencies in the first groupaccording to claim
 1. 3. The method of claim 2, further comprising thestep of Interleaving the second group of frequencies and durations (theslots) with the first group of frequencies and durations according tothe ratio determined from claims 1 and 2,
 4. The method of claim 3,further comprising the step of Structuring a hopping pattern such thatat the end of the hop cycle all frequencies will have been transmittedupon evenly.
 5. The method of claim 4, wherein the second group offrequencies is distributed throughout the hop cycle and not in a singlecontiguously grouped period.
 6. The method of claim 1, furthercomprising the step of Transmitting a first identifying data sequence onthat second group of shorter duration frequencies (the slots) accordingto claim 1 which is repeated consecutively for a minimum of the productof the intended receivers maximum tune time plus detect time for saiddata sequence multiplied by the total quantity of frequencies in saidsecond group according to claim 1 followed by optionally—a secondarynetwork identification data sequence followed by some amount of hoppingsynchronization data.
 7. The method of claim 4, further comprising thestep of one or more receivers scanning for a first identifying datasequence according to claim 6 on the second group of frequencies.
 8. Themethod of claim 7, further comprising the step of upon valid detectionof network identification data, said receiver continues receiving onsaid frequency to detect optional secondary network identification datasequence followed by some amount of hopping synchronization datatransmitted. if valid secondary system identification and hoppingsynchronization is not decoded—receiver uses predetermined dwell timerto resume scanning.
 9. The method of claim 8, wherein hoppingsynchronization data received from the second group of frequencies isused to synchronize with the hopping pattern and begin receiving payloaddata on the first group of frequencies.